Lower Bounds for Measurable Chromatic Numbers
نویسندگان
چکیده
منابع مشابه
Lower Bounds for Measurable Chromatic Numbers
The Lovász theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of distance graphs on compact metric spaces. In particular we consider distance graphs on the unit sphere. There we transform the original infinite semidefinit...
متن کاملMeasurable chromatic numbers
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [N]N, although its Borel chromatic number is א0. We also show that if add(null) = c, then the universally measurable chromatic number of every treei...
متن کاملBounds on the Measurable Chromatic Number
Let H be a set of positive real numbers. We define the geometric graph GH as follows: its vertex set is R” or S”, and two vertices are adjacent if the distance between them belongs to H. If H = { 1) we write Gi. A set A of vertices is H-independent if A is independent in GH. The problem we consider is: how big can an H-independent set be? That is, how big can a set be if certain distances are f...
متن کاملLower bounds for Z-numbers
Let p/q be a rational noninteger number with p > q ≥ 2. A real number λ > 0 is a Zp/q-number if {λ(p/q)n} < 1/q for every nonnegative integer n, where {x} denotes the fractional part of x. We develop several algorithms to search for Zp/q-numbers, and use them to determine lower bounds on such numbers for several p and q. It is shown, for instance, that if there is a Z3/2-number, then it is grea...
متن کاملLower bounds for the clique and the chromatic numbers of a graph
G is any simple graph with m edges and n veriices where these vertices have vertex degrees d(l)zd(2)r...rd(n), respectively. General algorithms for the exact calculation of x(G), the chromatic number of G, are almost always of ‘branch and bound’ type; this type of algorithm requires an easily constructed lower bound for x(G). In this paper it is shown that, for a number of such bounds (many of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometric and Functional Analysis
سال: 2009
ISSN: 1016-443X,1420-8970
DOI: 10.1007/s00039-009-0013-7